Weak Oblivious Transfer from Strong One-Way Functions
نویسندگان
چکیده
We consider weak oblivious transfer (OT) from strong one-way functions and the paradigm of transforming unconditionally secure protocols in Maurer’s bounded storage model into computational secure protocols in the random oracle model. Weak OT is secure against adversaries which have a quadratic resource gap to honest parties. We prove that the random oracle can be replaced with strong one-way functions in the OT protocol. We construct an OT protocol achieving quadratic security from strong one-way functions.
منابع مشابه
Building Injective Trapdoor Functions From Oblivious Transfer
Injective one-way trapdoor functions are one of the most fundamental cryptographic primitives. In this work we give a novel construction of injective trapdoor functions based on oblivious transfer for long strings. Our main result is to show that any 2-message statistically sender-private semihonest oblivious transfer (OT) for strings longer than the sender randomness implies the existence of i...
متن کاملFair Games against an All-Powerful Adversary
Suppose that a weak (polynomial time) device needs to interact over a clear channel with a strong (in nitely-powerful) and untrustworthy adversarial device. Assuming the existence of one-way functions, during this interaction (game) the in nitelypowerful device can encrypt and (computationally) hide information from the weak device. However, to keep the game fair, the weak player must hide info...
متن کاملOblivious Transfer from Weak Noisy Channels
Various results show that oblivious transfer can be implemented using the assumption of noisy channels. Unfortunately, this assumption is not as weak as one might think, because in a cryptographic setting, these noisy channels must satisfy very strong security requirements. Unfair noisy channels, introduced by Damg̊ard, Kilian and Salvail [Eurocrypt ’99], reduce these limitations: They give the ...
متن کاملBit Commitment, Oblivious Transfer, and Mental Poker without One-way Functions
While it is fairly obvious that a secure (bit) commitment between two parties is impossible without a one-way function, we show that it is possible if the number of parties is at least 3. Then we show how our unconditionally secure (bit) commitment scheme for 3 parties can be used to arrange an unconditionally secure (bit) commitment between just two parties if they use a “dummy” (e.g., a compu...
متن کاملSecure verifiable non-interactive oblivious transfer protocol using RSA and Bit commitment on distributed environment
In this paper, we have discussed the issues concerning the basic concept and classification of OT (Oblivious Transfer). We have proposed secure verifiable non-interactive oblivious transfer protocols for the exchange of secrets on distributed environments. One is a new secure verifiable noninteractive oblivious transfer protocol using RSA, the other is that with bit commitment using one-way fun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011